Practical experience with ALGOL 68-RT

A One Pass Algorithm for Compiling ALGOL 68 Declarations

A Space-Saving Technique for Assigning Algol 68 Multiple Values

The undghtforward way of elaborating an assignation d :its in an ALGOL 68 implementation is (1): • elaborate the destination d and the source s, yielding a name N and a value V; • assign fire value V to the Elaine N. In many cases, the elaboration of s will consist of the ovation of a copy on the working stack of an already existing value V. This value is assigned to N by copying it once more i...

The Formal Termination Problem for Programs with Finite ALGOL 68-Modes

In f 1 l] the importance of the formal termination problem for a high level programming language has been pointed out. If this problem is algorithmically solvable, then the translator is at least principally able to check whether certain properties closely related to termination like macro property of programs or nonrecursivity or block behaviour of procedures are fulfilled and then to produce ...

Practical Aspects of Specialization of Algol-like Programs

A linearized scheme of polyvariant specialization for im perative languages is described in the paper The scheme is intended for increasing e ciency of specialization Main properties of the scheme are linear generation of residual code and single memory shared by di erent variants of specialization process Introduction As it was mentioned in The memory requirements for the specializer are at th...

Idealized Algol with activeexpressionsExtended

The manipulation of objects with state which changes over time is all-pervasive in computing. Perhaps the simplest example of such objects are the program variables of classical imperative languages. An important strand of work within the study of such languages, pioneered by John Reynolds, focuses on \Idealized Algol", an elegant synthesis of imperative and functional features. We present a no...